Bounding the Dimension of Points on a Line
نویسندگان
چکیده
We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, ax+ b), given real numbers a, b, and x. We apply our main theorem to a problem in fractal geometry, giving an improved lower bound on the (classical) Hausdorff dimension of generalized sets of Furstenberg type.
منابع مشابه
On Passive Quadrupedal Bounding with Flexible Linear Torso
This paper studies the effect of flexible linear torso on the dynamics of passive quadruped bounding. A reduced-order passive and conservative model with linear flexible torso and springy legs is introduced. The model features extensive spine deformation during high-speed bounding, resembling those observed in a cheetah. Fixed points corresponding to cyclic bounding motions are found and calcul...
متن کاملA Sociological Study on the Effect of the Facebook for Bounding Social Capital among the Youth
Face book is virtual and cybernetic network which causes an effective force and among the youth. It shows that if the usage of the face book network increases at home the rate of the interaction and the bounding social capital decreases as well. It also indicates that the effect of face book usage among the young people has increased already. Through a questionnaire by a survey method, more tha...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملAutomatic Bounding Estimation in Modified Nlms Algorithm
Modified Normalized Least Mean Square (MNLMS) algorithm, which is a sign form of NLMS based on set-membership (SM) theory in the class of optimal bounding ellipsoid (OBE) algorithms, requires a priori knowledge of error bounds that is unknown in most applications. In a special but popular case of measurement noise, a simple algorithm has been proposed. With some simulation examples the performa...
متن کاملبازیابی مبتنی بر شکل اجسام با توصیفگرهای بدست آمده از فرآیند رشد کانتوری
In this paper, a novel shape descriptor for shape-based object retrieval is proposed. A growing process is introduced in which a contour is reconstructed from the bounding circle of the shape. In this growing process, circle points move toward the shape in normal direction until they get to the shape contour. Three different shape descriptors are extracted from this process: the first descript...
متن کامل